On the Generation of Random Binary Search Trees

We consider the computer generation of random binary search trees with n nodes for the standard random permutation model . The algorithms discussed here output the number of external nodes at each level, but not the shape of the tree. This is important, for example, when one wishes to simulate the height of the binary search tree . Various paradigms are proposed, including depth-first search with pruning, incremental methods in which the tree grows with random-sized jumps, and a tree growing procedure gleaned from birth--and-death processes. The last method takes O(logo n) expected time . Key words, binary search tree, height of a tree, probabilistic analysis, expected complexity, simulation, random combinatorial object, point process, recursive procedure AMS subject classification, 68Q25, 68U20, 93E30, 00A72, 11 K45, 65C05, 65C10, 05080, 68R++, 68P05, 68P10, 60C05